33 搜索旋转排序数组

https://leetcode.cn/leetbook/read/top-interview-questions-medium/xvyz1t/

cost: 18m27s

class Solution {
public:
    int search(vector<int>& nums, int target) {
        int left = 0, right = nums.size() - 1;
        while (left <= right) {
            int mid = left + (right - left) / 2;
            int num = nums[mid];
            if (num == target) {
                return mid;
            }
            if (nums[left] == target) {
                return left;
            }
            if (nums[right] == target) {
                return right;
            }
            if (num > nums[left]) {
                if (num < target) {
                    left = mid + 1;
                } else {
                    if (nums[left] < target) {
                        right = mid - 1;
                    } else {
                        left = mid + 1;
                    }
                }
                continue;
            }
            if (num > target) {
                right = mid - 1;
                continue;
            }
            if (nums[left] < target) {
                right = mid - 1;
                continue;
            }
            left = mid + 1;
        }
        return -1;
    }
};